Block graph

Results: 40



#Item
11Using graphs to find the best block designs arXiv:1111.3768v1 [math.ST] 16 Nov 2011 R. A. Bailey and Peter J. Cameron R. A. Bailey obtained a DPhil in group theory from the University of Oxford. She worked at the Open Un

Using graphs to find the best block designs arXiv:1111.3768v1 [math.ST] 16 Nov 2011 R. A. Bailey and Peter J. Cameron R. A. Bailey obtained a DPhil in group theory from the University of Oxford. She worked at the Open Un

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2011-11-16 20:10:53
12JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015  Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:35
13Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1  Princeton University, Princeton, NJ 08544, USA. E-mail: mc

Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky∗1 , Jan Goedgebeur†2 , Oliver Schaudt3 , and Mingxian Zhong4 1 Princeton University, Princeton, NJ 08544, USA. E-mail: mc

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-09-19 08:52:09
14C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/ptolemaic-roots/ptolesplit-journal.dvi

C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/ptolemaic-roots/ptolesplit-journal.dvi

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-01-29 06:00:42
15Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 2, pp. 111–DOI: jgaaOrdering Metro Lines by Block Crossings Martin Fink 1 Sergey Pupyrev 2,3 Alexander Wolff 4

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 2, pp. 111–DOI: jgaaOrdering Metro Lines by Block Crossings Martin Fink 1 Sergey Pupyrev 2,3 Alexander Wolff 4

Add to Reading List

Source URL: jgaa.info

Language: English - Date: 2015-02-27 17:14:01
    16Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA

    Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA

    Add to Reading List

    Source URL: coral.ie.lehigh.edu

    Language: English - Date: 2012-12-26 15:36:44
    17

    PDF Document

    Add to Reading List

    Source URL: www.dmi.unict.it

    Language: English - Date: 2003-03-15 15:38:36
    18Extremal Parameters in Sub-Critical Graph Classes Michael Drmota∗ Marc Noy†  August 2012

    Extremal Parameters in Sub-Critical Graph Classes Michael Drmota∗ Marc Noy† August 2012

    Add to Reading List

    Source URL: www.dmg.tuwien.ac.at

    Language: English - Date: 2012-08-31 04:06:36
    19. . Approximate Counting of Matchings in (3, 3)-Hypergraphs? Andrzej Dudek??

    . . Approximate Counting of Matchings in (3, 3)-Hypergraphs? Andrzej Dudek??

    Add to Reading List

    Source URL: theory.cs.uni-bonn.de

    Language: English - Date: 2014-02-28 04:12:51
    20A Facility Location Problem under Competition Yonatan Gur ∗ Nicolas E. Stier-Moses ∗ May 19, 2011

    A Facility Location Problem under Competition Yonatan Gur ∗ Nicolas E. Stier-Moses ∗ May 19, 2011

    Add to Reading List

    Source URL: research.microsoft.com

    Language: English - Date: 2011-05-19 07:14:21